Clustering of Data Represented by Pairwise Comparisons
نویسندگان
چکیده
Abstract In this paper, experimental data, given in the form of pairwise comparisons, such as distances or similarities, are considered. Clustering algorithms for processing data developed based on well-known k-means procedure. Relations to factor analysis shown. The problems improving clustering quality and finding proper number clusters case comparisons Illustrative examples provided.
منابع مشابه
Fuzzy Clustering of Patterns Represented by Pairwise Dissimilarities
Clustering is the problem of grouping objects on the basis of a similarity measure between them. This paper considers the approaches belonging to the K-means family, in particular those based on fuzzy memberships. When patterns are represented by means of non-metric pairwise dissimilarities, these methods cannot be directly applied, since they are not guaranteed to converge. Symmetrization and ...
متن کاملPairwise Data Clustering by Deterministic Annealing
Partitioning a data set and extracting hidden structure from the data arises in different application areas of pattern recognition, speech and image processing. Pairwise data clustering is a combinatorial optimization method for data grouping which extracts hidden structure from proximity data. We describe a deterministic annealing approach to pairwise clustering which shares the robustness pro...
متن کاملCentral and Pairwise Data Clustering by Competitive Neural Networks
Data clustering amounts to a combinatorial optimization problem to reduce the complexity of a data representation and to increase its precision. Central and pairwise data clustering are studied in the maximum entropy framework. For central clustering we derive a set of reestimation equations and a minimization procedure which yields an optimal number of clusters, their centers and their cluster...
متن کاملSelection by pairwise comparisons with limited resources
We analyze different methods of sorting and selecting a set of objects by their intrinsic value, via pairwise comparisons whose outcome is uncertain. After discussing the limits of repeated Round Robins, two new methods are presented: The ran-fil requires no previous knowledge on the set under consideration, yet displaying good performances even in the least favorable case. Themin-entmethod set...
متن کاملComparisons Between Data Clustering Algorithms
Clustering is a division of data into groups of similar objects. Each group, called a cluster, consists of objects that are similar between themselves and dissimilar compared to objects of other groups. This paper is intended to study and compare different data clustering algorithms. The algorithms under investigation are: k-means algorithm, hierarchical clustering algorithm, self-organizing ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Control and Cybernetics
سال: 2022
ISSN: ['0324-8569']
DOI: https://doi.org/10.2478/candc-2022-0021